Error analysis of digital filters using HOL theorem proving
نویسندگان
چکیده
منابع مشابه
Error analysis of digital filters using HOL theorem proving
When a digital filter is realized with floating-point or fixed-point arithmetics, errors and constraints due to finite word length are unavoidable. In this paper, we show how these errors can be mechanically analysed using the HOL theorem prover. We first model the ideal real filter specification and the corresponding floating-point and fixedpoint implementations as predicates in higher-order l...
متن کاملProving the Completeness Theorem within Isabelle/HOL
This is a report about formalising a maths proof with the theorem prover Isabelle/HOL. The proof was for the completeness theorem of first order logic. The informal proof used symmetry arguments (duality) and also gave the cut elimination theorem as a corollary. Both these aspects were preserved formally. The paper outlines this formalisation. It notes that parts of the proof can be viewed as a...
متن کاملHybrid Interactive Theorem Proving Using Nuprl and HOL
In this paper we give the rst example of a signiicant piece of formal mathematics conducted in a hybrid of two diierent interactive systems. We constructively prove a theorem in Nuprl, from which a program can be extracted, but we use classical mathematics imported from HOL, and a connection to some of HOL's deenitional packages, for parts of the proof that do not contribute to the program.
متن کاملProbabilistic Analysis Using Theorem Proving
In this chapter, the authors first provide the overall methodology for the theorem proving formal probabilistic analysis followed by a brief introduction to the HOL4 theorem prover. The main focus of this book is to provide a comprehensive framework for formal probabilistic analysis as an alternative to less accurate techniques like simulation and paper-and-pencil methods and to other less scal...
متن کاملProbabilistic Analysis using Theorem Proving
Traditionally, computer simulation techniques are used to perform probabilistic analysis. However, they provide less accurate results and cannot handle large-scale problems due to their enormous CPU time requirements. Recently, a significant amount of formalization has been done in the HOL theorem prover that allows us to conduct precise probabilistic analysis using theorem proving and thus ove...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Applied Logic
سال: 2007
ISSN: 1570-8683
DOI: 10.1016/j.jal.2006.11.001